Video coding using cross-component linear model

ABSTRACT

A method and a computing device are provided for video coding. The method may include deriving parameter α and parameter β for a CCLM mode by using a predetermined number of neighboring reconstructed luma samples and chroma samples in a CU; and generating a final chroma predictor for the chroma samples of the CU by using the parameter α and the parameter β.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application Ser. No. 17/372,340 filed on Jul. 9, 2021, which is a continuation of International Application No.: PCT/US2020/012814, filed on Jan. 8, 2020, which claims the benefit of U.S. Provisional Application No. 62/790,459 filed on Jan. 9, 2019. The entire disclosure of the aforementioned application is incorporated herein by reference in its entirety.

FIELD

The present disclosure relates generally to video coding and compression. More specifically, this disclosure relates to systems and methods for performing video coding using Cross-Component Linear Model. In particular example embodiments, methods are described by which a final chroma predictor for the chroma samples of a coding unit.

BACKGROUND

This section provides background information related to the present disclosure. The information contained within this section should not necessarily be construed as prior art.

Various video coding techniques may be used to compress video data. Video coding is performed according to one or more video coding standards. For example, video coding standards include versatile video coding (VVC), joint exploration test model (JEM), high-efficiency video coding (H.265/HEVC), advanced video coding (H.264/AVC), moving picture experts group (MPEG) coding, or the like. Video coding generally utilizes prediction methods (e.g., inter-prediction, intra-prediction, or the like) that take advantage of redundancy present in video images or sequences. An important goal of video coding techniques is to compress video data into a form that uses a lower bit rate, while avoiding or minimizing degradations to video quality. With ever-evolving video services becoming available, coding techniques with better compression efficiency are needed.

SUMMARY

This section provides a general summary of the disclosure, and is not a comprehensive disclosure of its full scope or all of its features.

According to a first aspect of the present disclosure, a video coding method is performed at a computing device having one or more processors and memory storing a plurality of programs to be executed by the one or more processors. The method includes deriving a first parameter α and a second parameter (3 for a cross-component linear model (CCLM) mode by using a predetermined number of neighboring reconstructed luma samples and chroma samples in a coding unit (CU); and generating a final chroma predictor for the chroma samples of the CU by using the first parameter α and the second parameter (3.

According to a second aspect of the present disclosure, a computing device is provided. The computing device includes at least one processor; a non-transitory storage coupled to the one or more processors; and a plurality of programs stored in the non-transitory storage that, when executed by the processor, cause the computing device to perform acts comprising: deriving a first parameter α and a second parameter (3 for a cross-component linear model (CCLM) mode by using a predetermined number of neighboring reconstructed luma samples and chroma samples in a coding unit (CU); and generating a final chroma predictor for the chroma samples of the CU by using the first parameter α and the second parameter β.

BRIEF DESCRIPTION OF THE DRAWINGS

Hereinafter, sets of illustrative, non-limiting embodiments of the present disclosure will be described in conjunction with the accompanying drawings. Variations of structure, method, or functionality may be implemented by those of ordinary skill in the relevant art based on the examples presented herein, and such variations are all contained within the scope of the present disclosure. In cases where no conflict is present, the teachings of different embodiments may, but need not, be combined with one another.

FIG. 1 is a block diagram setting forth an illustrative encoder which may be used in conjunction with many video coding standards.

FIG. 2 is a block diagram setting forth an illustrative decoder which may be used in conjunction with many video coding standards.

FIG. 3 is the flow chart of the video coding method.

FIG. 4 is an example of Luma/Chroma Pixel Sampling Grid.

FIG. 5 shows the locations of the samples used for the derivation of α and β.

FIG. 6 shows the straight-line derivation of α and β using the min-max method.

FIG. 7 shows the LM_A mode.

FIG. 8 shows the LM_L mode.

FIG. 9 is Luma/Chroma Pixel Sampling Grid for YUV 4:2:2 format.

FIG. 10 is Luma/Chroma Pixel Sampling Grid for YUV 4:4:4 format.

FIG. 11 shows the multiple neighbors for MMLM.

FIG. 12 shows the locations of an example of three sample pairs.

FIG. 13 shows the locations of another example of three sample pairs.

FIG. 14 shows the locations of an example of four sample pairs.

FIG. 15 shows the locations of another example of four sample pairs.

DETAILED DESCRIPTION

The terms used in the present disclosure are directed to illustrating particular examples, rather than to limit the present disclosure. The singular forms “a” “an” and “the” as used in the present disclosure as well as the appended claims also refer to plural forms unless other meanings are definitely contained in the context. It should be appreciated that the term “and/or” as used herein refers to any or all possible combinations of one or more associated listed items.

It shall be understood that, although the terms “first,” “second,” “third,” etc. may be used herein to describe various information, the information should not be limited by these terms. These terms are only used to distinguish one category of information from another. For example, without departing from the scope of the present disclosure, first information may be termed as second information; and similarly, second information may also be termed as first information. As used herein, the term “if” may be understood to mean “when” or “upon” or “in response to,” depending on the context.

Reference throughout this specification to “one embodiment,” “an embodiment,” “another embodiment,” or the like in the singular or plural means that one or more particular features, structures, or characteristics described in connection with an embodiment are included in at least one embodiment of the present disclosure. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment,” “in another embodiment,” or the like in the singular or plural in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics in one or more embodiments may be combined in any suitable manner.

Conceptually, many video coding standards are similar, including those previously mentioned in the Background section. For example, virtually all video coding standards use block-based processing, and share similar video coding block diagrams to achieve video compression.

FIG. 1 shows a block diagram of an illustrative encoder 100 which may be used in conjunction with many video coding standards. In the encoder 100, a video frame is partitioned into a plurality of video blocks for processing. For each given video block, a prediction is formed based on either an inter prediction approach or an intra prediction approach. In inter prediction, one or more predictors are formed through motion estimation and motion compensation, based on pixels from previously reconstructed frames. In intra prediction, predictors are formed based on reconstructed pixels in a current frame. Through mode decision, a best predictor may be chosen to predict a current block.

A prediction residual, representing the difference between a current video block and its predictor, is sent to a Transform circuitry 102. Transform coefficients are then sent from the Transform circuitry 102 to a Quantization circuitry 104 for entropy reduction. Quantized coefficients are then fed to an Entropy Coding circuitry 106 to generate a compressed video bitstream. As shown in FIG. 1 , prediction-related information 110 from an inter prediction circuitry and/or an Intra Prediction circuitry 112, such as video block partition info, motion vectors, reference picture index, and intra prediction mode, are also fed through the Entropy Coding circuitry 106 and saved into a compressed video bitstream 114.

In the encoder 100, decoder-related circuitries are also needed in order to reconstruct pixels for the purpose of prediction. First, a prediction residual is reconstructed through an Inverse Quantization 116 and an Inverse Transform circuitry 118. This reconstructed prediction residual is combined with a Block Predictor 120 to generate unfiltered reconstructed pixels for a current video block.

To improve coding efficiency and visual quality, an in-loop filter is commonly used. For example, a deblocking filter is available in AVC, HEVC as well as the current version of VVC. In HEVC, an additional in-loop filter called SAO (sample adaptive offset) is defined to further improve coding efficiency. In the now-current version of the VVC standard, yet another in-loop filter called ALF (adaptive loop filter) is being actively investigated, and it has a good chance of being included in the final standard.

These in-loop filter operations are optional. Performing these operations helps to improve coding efficiency and visual quality. They may also be turned off as a decision rendered by the encoder 100 to save computational complexity.

It should be noted that intra prediction is usually based on unfiltered reconstructed pixels, while inter prediction is based on filtered reconstructed pixels if these filter options are turned on by the encoder 100.

FIG. 2 is a block diagram setting forth an illustrative decoder 200 which may be used in conjunction with many video coding standards. This decoder 200 is similar to the reconstruction-related section residing in the encoder 100 of FIG. 1 . In the decoder 200 (FIG. 2), an incoming video bitstream 201 is first decoded through an Entropy Decoding 202 to derive quantized coefficient levels and prediction-related information. The quantized coefficient levels are then processed through an Inverse Quantization 204 and an Inverse Transform 206 to obtain a reconstructed prediction residual. A block predictor mechanism, implemented in an Intra/inter Mode Selector 212, is configured to perform either an Intra Prediction 208, or a Motion Compensation 210, based on decoded prediction information. A set of unfiltered reconstructed pixels are obtained by summing up the reconstructed prediction residual from the Inverse Transform 206 and a predictive output generated by the block predictor mechanism, using a Summer 214. In situations where an in-loop filter is turned on, a filtering operation is performed on these reconstructed pixels to derive the final reconstructed video for output.

To reduce the cross-component redundancy, a cross-component linear model (CCLM) prediction mode is used in the VVC. The YUV format 4:2:0 is used in common test condition during the development of VVC and the sampling grid of the luma samples and the chroma samples for YUV format 4:2:0 is shown in FIG. 4 . The coordinates of the luma samples and the chroma samples (down-sampled luma samples) are also illustrated in the FIG. 4 . RecL′ [x,y] represents the down-sampled top and left neighboring reconstructed luma samples, RecC′[x,y] represents the top and left neighboring reconstructed chroma samples, x and y are pixel index as shown in the figure. In this disclosure, we propose several methods to reduce the complexity of the derivation of the CCLM parameters.

The present disclosure relates generally to coding (e.g., encoding and decoding) video data. More specifically, this disclosure relates to video coding methods and computing device for reducing the cross-component redundancy for video coding methods. A CCLM predictor mode is used, for which the chroma samples are predicted based on the reconstructed luma samples of the same CU. A computing device, comprising: at least one processor; a non-transitory storage coupled to the one or more processors; and a plurality of programs stored in the non-transitory storage that, when executed by the processor, cause the computing device to perform acts of the video coding method.

As shown in FIG. 3 , the video coding method includes at least following steps:

step 10: deriving a first parameter α and a second parameter β for a CCLM mode by using a predetermined number of neighboring reconstructed luma samples and chroma samples in a CU.

step 20: generating a final chroma predictor for the chroma samples of the CU by using the first parameter α and the second parameter β.

In step 20, to generate the final chroma predictor for the chroma samples of the CU by using following equation:

$\begin{matrix} {{Pre{d_{c}\left( {x,y} \right)}} = {{\alpha*{{rec}_{L}^{\prime}\left( {x,y} \right)}} + \beta}} & (1) \end{matrix}$

wherein pred_(c) (x, y) is the final chroma predictor for the chroma samples of the CU, rec_(L)′(x, y) is the downsampled reconstructed luma samples of the CU, x indicates a row index, y indicates a column index.

The coordinates of the luma samples and the chroma samples (down-sampled luma samples) are illustrated in the FIG. 5 .

Parameter α and parameter β are derived by following equation (termed min-max method in the following sections):

$\begin{matrix} {{\alpha = \frac{y_{B} - y_{A}}{x_{B} - x_{A}}}{\beta = {y_{A} - {\alpha x_{A}}}}} & (2) \end{matrix}$

Each chroma sample and its corresponding luma sample are termed a sample pair. wherein y_(B) is a chroma sample value of the maximum sample pair, y_(A) is a chroma sample value of the minimum sample pair, x_(B) is a luma sample value of the maximum sample pair, x_(A) is a luma sample value of the minimum sample pair.

The 2 points (couple of luma and chroma) (A, B) are the minimum and maximum values inside the set of neighboring luma samples as depicted in FIG. 6 . FIG. 6 is the illustration of the straight line between minimum and maximum luma value where the linear model parameter α and parameter β are obtained according to the equation (2).

In FIG. 5 , Rec_(L)′ [x,y] represents the down-sampled top and left neighboring reconstructed luma samples, Rec_(c) [x,y] represents the top and left neighboring reconstructed chroma samples, x indicates a row index, y indicates a column index. It is noted that the square blocks in FIG. 5 are the reconstructed luma samples which correspond to the locations of the luma samples depicted in FIG. 4 ; the circles in FIG. 5 corresponds to the locations of the chroma samples or down-sampled luma samples depicted in FIG. 4 . For a coding block with a square shape, the min-max method is applied directly. For a non-square coding block, the neighboring samples of the longer boundary are first subsampled to have the same number of samples as for the shorter boundary. FIG. 5 shows the location of the left and above samples and the sample of the current block involved in the CCLM mode.

The min-Max method computation is performed as part of the decoding process and is not just as an encoder search operation. As a result, no syntax is used to convey the parameter α and parameter β values to the decoder. Currently, the equation/filter (3) is used as the luma down-sampling filters to generate the down-sampled luma samples. However, different equations/filters could be selected to generate the down-sampled luma samples as shown in equation (3) to (19). It is noted that equations (5) to (10) can be regarded as direct taking sample without the down-sampling process.

$\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{Re{c_{L}\left\lbrack {{2x},{2y}} \right\rbrack}*2} + {Re{c_{L}\left\lbrack {{{2x} + 1},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} - 1},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{2x},{{2y} + 1}} \right\rbrack}*2} + {Re{c_{L}\left\lbrack {{{2x} + 1},{{2y} + 1}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} - 1},{{2y} + 1}} \right\rbrack}} + 4} \right) \gg 3}} & (3) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{Re{c_{L}\left\lbrack {{2x},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{2x},{{2y} + 1}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} + 1},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} + 1},{{2y} + 1}} \right\rbrack}} + 2} \right) \gg 2}} & (4) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {Re{c_{L}\left\lbrack {{2x},{2y}} \right\rbrack}}} & (5) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {Re{c_{L}\left\lbrack {{{2x} + 1},{2y}} \right\rbrack}}} & (6) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {Re{c_{L}\left\lbrack {{{2x} - 1},{2y}} \right\rbrack}}} & (7) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {Re{c_{L}\left\lbrack {{{2x} - 1},{{2y} + 1}} \right\rbrack}}} & (8) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {Re{c_{L}\left\lbrack {{2x},{{2y} + 1}} \right\rbrack}}} & (9) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {Re{c_{L}\left\lbrack {{{2x} + 1},{{2y} + 1}} \right\rbrack}}} & (10) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{Re{c_{L}\left\lbrack {{2x},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{2x},{{2y} + 1}} \right\rbrack}} + 1} \right) \gg 1}} & (11) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{Re{c_{L}\left\lbrack {{2x},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} + 1},{2y}} \right\rbrack}} + 1} \right) \gg 1}} & (12) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{Re{c_{L}\left\lbrack {{{2x} + 1},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} + 1},{{2y} + 1}} \right\rbrack}} + 1} \right) \gg 1}} & (13) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{Re{c_{L}\left\lbrack {{2x},{{2y} + 1}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} + 1},{{2y} + 1}} \right\rbrack}} + 1} \right) \gg 1}} & (14) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{2 \times Re{c_{L}\left\lbrack {{2x},{{2y} + 1}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} - 1},{{2y} + 1}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} + 1},{{2y} + 1}} \right\rbrack}} + 2} \right) \gg 2}} & (15) \end{matrix}$ $\begin{matrix} {{{{Rec}^{\prime}}_{L}\left\lbrack {x,y} \right\rbrack} = {\left( {{Re{c_{L}\left\lbrack {{{2x} + 1},{2y}} \right\rbrack}} + {Re{c_{L}\left\lbrack {{{2x} + 1},{{2y} + 1}} \right\rbrack}} + 1} \right) \gg 1}} & (16) \end{matrix}$ $\begin{matrix} {{{Rec}_{L}^{\prime}\left\lbrack \text{⁠}{x,\text{⁠}y} \right\rbrack} = {\left\lbrack \text{⁠}{{{Rec}_{L}\left( {{{2x} - 1},{2y}} \right)} + {3 \cdot {{Rec}_{L}\left( {{2x},{2y}} \right)}} + {3 \cdot {{Rec}_{L}\left( {{{2x} + 1},{2y}} \right)}} + {Re{c_{L}\left( {{{2x} + 2},{2y}} \right)}} + {{Re}{c_{L}\left( {{{2x} - 1},{{2y} + 1}} \right)}} + {3 \cdot {{Rec}_{L}\left( {{2x},{{2y} + 1}} \right)}} + 8} \right\rbrack \gg 4}} & (17) \end{matrix}$ $\begin{matrix} {{{Rec}_{L}^{\prime}\left\lbrack {x,y} \right\rbrack} = {\left\lbrack {{Re{c_{L}\left( {{{2x} - 1},{{2y} - 1}} \right)}} + {2 \cdot {{Rec}_{L}\left( {{2x},{{2y} - 1}} \right)}} + {Re{c_{L}\left( {{{2x} + 1},{{2y} - 1}} \right)}} + {2 \cdot {{Rec}_{L\square}\left( {{{2x} - 1},{2y}} \right)}} + {4 \cdot {{Rec}_{L}\left( {{2x},{2y}} \right)}} + {2 \cdot {{Rec}_{L}\left( {{{2x} + 1},{2y}} \right)}} + {Re{c_{L}\left( {{{2x} - 1},{{2y} + 1}} \right)}} + {2 \cdot {{Rec}_{L}\left( {{2x},{{2y} + 1}} \right)}} + {Re{c_{L}\left( {{{2x} + 1},{{2y} + 1}} \right)}} + 8} \right\rbrack \gg 4}} & (18) \end{matrix}$ $\begin{matrix} {{{Rec}_{L}^{\prime}\left\lbrack {x,y} \right\rbrack} = {\left\lbrack {{Re{c_{L}\left( {{2x},{{2y} - 1}} \right)}} + {Re{c_{L}\left( {{{2x} + 1},{{2y} - 1}} \right)}} + {2 \cdot {{Rec}_{L}\left( {{2x},{2y}} \right)}} + {3 \cdot {{Rec}_{L}\left( {{{2x} + 1},{2y}} \right)}} + {Re{c_{L}\left( {{2x},{{2y} + 1}} \right)}} + {Re{c_{L}\left( {{{2x} + 1},{{2y} + 1}} \right)}} + 4} \right\rbrack \gg 3}} & (19) \end{matrix}$

Besides the above template and left template can be used to calculate the linear model coefficients together, they also can be used alternatively in the other 2 LM modes, called LM_A, and LM_L modes, respectively. As shown in FIG. 7 , in LM_A mode, the above template is used to calculate the linear model coefficients. To get more samples, the above template is extended to (W+H). As shown in FIG. 8 , in LM_L mode, only left template is used to calculate the linear model coefficients. To get more samples, the left template is extended to (H+W). For a non-square block, the above templates are extended to W+W, the left template are extended to H+H. When the above/left template is not available, then the LM_A/LM_L mode will not be checked or signaled. When the available samples not enough, the template will be padded by copying the right-most (for top template) sample or the below-most (for left template) sample to the nearest log 2 number. Besides 4:2:0 YUV format, the codec may also support 4:2:2 (as shown in FIG. 9 ) and 4:4:4 format (as shown in FIG. 10 ).

Several methods to improve LM modes are proposed in the JVET meeting as described below.

MMLM-mode: MMLM refers to multi-model LM mode, where two linear models are used to derive the chroma sample prediction. The reconstructed luma values are partitioned into two categories: one model is applied for each category. The derivation of the α and 0 parameters for each model is done as in the CCLM-mode; where the reconstructed luma (down-sampled) used to derive the parameters are also partitioned for each model accordingly.

MFLM-mode: MFLM refers to multi-filter LM mode, where different filters are used to down-sample the reconstructed luma samples used in the prediction model. Four such filters are used, and the particular filter used is indicated/signaled in the bitstream.

LM Angular prediction: In this mode, MMLM mode and a non-LM mode are combined by averaging the prediction samples obtained by the two modes.

Multiple Neighbor-based Linear Model (MNLM) uses multiple neighbor sets for MMLM derivation to cover various linear relationships between luma samples and chroma samples in CU. As depicted in FIG. 11 , three MMLM with different neighbor sets are proposed in MNLM:

MMLM: A, B, C, D (including above and left neighbors)

Above-MMLM: C, D, F, H (including above-only neighbors)

Left-MMLM: A, B, E, G (including left-only neighbors)

As illustrated in FIG. 11 , A is the second left neighbor. B is the first left neighbor. C is the first above neighbor. D is the second above neighbor. E is the third left neighbors. F is the third above neighbor. G is the fourth left neighbor. H is the fourth above neighbor.

The different CCLM prediction modes in MNLM are listed in the table below:

Mode index Description 0 CCLM (Above & Left neighbors) 1 MMLM (Above & Left neighbors) 2 MMLM (Above-only neighbors) 3 MMLM (Left-only neighbors)

Mode 0, Mode 1, Mode 2, and Mode 3 use the same down-sampling filter, but different neighbor sets for LM and MMLM derivation.

To reduce the complexity of the derivation of the CCLM parameters, in the first embodiment, three sample pairs are used to derive the parameter α and the parameter β. As shown in FIG. 12 , the sample pairs include: the top sample of the left neighboring samples(Rec′_(L) [−1,0], Rec_(c) [−1,0]), the bottom sample of the left neighboring samples(Rec′_(L) [−1, H−1], Rec_(c)[−1, H−1]), and the rightmost sample of the above neighboring samples(Rec′_(L) [W−1, −1], Rec_(c) [W−1, −1]). W and H denote the width and height of the chroma block.

In another embodiment, As shown in FIG. 13 , the sample pairs include: the leftmost sample of the above neighboring samples(Rec′_(L) [0, −1], Rec_(c)[0, −1]), the bottom sample of the left neighboring samples(Rec′_(L) [−1, H−1], Rec_(c)[−1, H−1]), and the rightmost sample of the above neighboring samples(Rec′_(L) [W−1, −1], Rec_(c)[W−1, −1]).

It is noted that, the sample pair selection is not restricted to the mentioned embodiments. The three sample pairs could be any three sample pairs selected from the above or left reconstructed neighboring samples and the neighboring samples are not restricted to be only one line above or one line left.

In one embodiment, the sample pairs which respectively have the largest luma sample value, the middle sample value, and the smallest luma sample value are identified through luma sample comparisons. The weighted average of the luma sample values of the maximum and middle sample pairs is denoted as x_(B) (as shown in equation (20)) and the weighted average of the chroma sample values of the maximum and middle sample pair is denoted as y_(B) (as shown in equation (22)); the weighted average of the luma sample values of the middle and minimum sample pairs is denoted as x_(A) (as shown in equation (21))and the weighted average of the chroma sample values of the middle and minimum sample pairs is denoted as y_(A) (as shown in equation (23)). The parameter α and parameter β are then calculated using the equation (2).

$\begin{matrix} {{x_{B} = {\left( {{w1*x_{\max}} + {w2*x_{mid}} + {{offset}1}} \right) \gg {N1}}};} & (20) \end{matrix}$ $\begin{matrix} {{x_{A} = {\left( {{w3*x_{mid}} + {w4*x_{\min}} + {{offset}2}} \right) \gg {N2}}};} & (21) \end{matrix}$ $\begin{matrix} {{y_{B} = {\left( {{w1*y_{\max}} + {w2*y_{mid}} + {{offset}1}} \right) \gg {N1}}};} & (22) \end{matrix}$ $\begin{matrix} {{y_{A} = {\left( {{w3*y_{mid}} + {w4*y_{\min}} + {{offset}2}} \right) \gg {N2}}};} & (23) \end{matrix}$

where x_(max) is the luma sample values of the maximum sample pair, x_(mid) is the luma sample values of the middle sample pair, x_(min) is the luma sample values of the minimum sample pair, y_(max) is the chroma sample values of the maximum sample pair, y_(mid) is the chroma sample values of the middle sample pair, y_(min) is the chroma sample values of the minimum sample pair; w1+w2=(1<<N1), offset1=1<<(N1−1); w3+w4=(1<<N2), offset2=1<<(N2−1).

Where w1 is a first weight factor, w2 is a second weight factor, w3 is a third weight factor, w4 is a fourth weight factor; N1 is the first average value, N2 is the second average value; offset1 is a first offset factor, offset2 is a second offset factor.

In one example where equal weighting is applied, w1=1, w2=1, w3=1, w4=1; N1=1, N2=1 and offset1=1, offset2=1.

In yet another example, w1=3, w2=1, w3=1, w4=3; N1=2, N2=2 and offset1=2, offset2=2.

In yet another embodiment, using i, j, k as the index for the three sample pairs, only two compares are performed between luma_(i) and luma_(j), luma_(i) and luma_(k). With the two comparisons, the three sample pairs could be either fully sorted by luma values or be divided into two groups; one contains two larger values and the other one contains one smaller value or vice versa. When the values are fully sorted, the methods as described in previous section could be used. When the sample pairs are divided into two groups, the luma and chroma sample(s) in the same group are weighted averaged, respectively (the single sample pair in a group practically does not need perform weighted average). For example, when there are two sample pairs in one group, the two luma values in one group are averaged with equal weights while the two chroma values are also averaged with equal weights. Here, the weighted averaged values are used as the x_(A), x_(B), y_(A) and y_(B) to derive CCLM parameter using (2).

In yet another embodiment, the sample pair which has the largest luma sample value and the sample pair which has the smallest luma sample value are identified through luma sample comparisons. The luma sample value of the maximum sample pair is denoted as x_(B) and the chroma sample value of the maximum sample pair is denoted as y_(B); the luma sample value of the minimum sample pair is denoted as x_(A) and the chroma sample value of the minimum sample pair is denoted as y_(A). The parameter α and parameter β are then calculated using the equation (2).

It is noted that, the derivation method for CCLM parameters is not restricted to the mentioned embodiments. The selected three sample pairs could be used in any manner to derive the CCLM parameters.

In the second embodiment, to reduce the complexity of the derivation of the CCLM parameters, use four sample pairs to derive the parameter α and the parameter β. As shown in FIG. 14 , the sample pairs include: the top sample of the left neighboring samples(Rec′_(L) [−1,0], Rec_(C)[−1,0]), the leftmost sample of the above neighboring samples(Rec′_(L) [0, −1], Rec_(c)[0, −1]), the bottom sample of the left neighboring samples(Rec′_(L) [−1, H−1], Rec_(c)[−1, H−1]), and the rightmost sample of the above neighboring samples(Rec′_(L) [W−1, −1], Rec_(c)[W−1, −1]).

In another embodiment, As shown in FIG. 15 , the sample pairs include: the quarter of width of the leftmost sample of the above neighboring samples(Rec′_(L) [W/4, −1], Rec_(c) [W/4, 1]), the quarter of height of the top sample of the left neighboring samples(Rec′_(L) [−1, H/4], Rec_(c) [−1, H/4]), the bottom sample of the left neighboring samples(Rec′_(L) [−1, H−1], Rec_(c)[−1, H−1]), and the rightmost sample of the above neighboring samples(Rec′_(L) [W−1, −1], Rec_(c)[W−1, −1]).

It is noted that, the sample pair selection is not restricted to the mentioned embodiments. The four sample pairs could be any four sample pairs selected from the above or left reconstructed neighboring samples and the neighboring samples are not restricted to be only one line above or one line left. For example, one sample pair sets include: the quarter of width of the leftmost sample of the above neighboring samples, the quarter of height of the top sample of the left neighboring samples, the three quarter of width of the leftmost sample of the above neighboring samples, the three quarter of height of the top sample of the left neighboring samples.

Alternatively, another sample pair sets include: the one-eighth of width of the leftmost sample of the above neighboring samples, the three-eighth of width of the leftmost sample of the above neighboring samples, the five-eighth of width of the leftmost sample of the above neighboring samples, the seven-eighth of width of the leftmost sample of the above neighboring samples.

Alternatively, another sample pair sets include: the one-eighth of height of the top sample of the left neighboring samples, the three-eighth of height of the top sample of the left neighboring samples, the five-eighth of height of the top sample of the left neighboring samples, the seven-eighth of height of the top sample of the left neighboring samples.

In one embodiment, the sample pairs which respectively have the two larger luma sample value and the two smaller luma sample value are identified through luma sample comparisons. The luma sample values of the two larger sample pairs are denoted as x_(B0), x_(B1) and the chroma sample value of the two larger sample pairs are denoted as y_(B0), y_(B1); the luma sample values of the two smaller sample pairs are denoted as x_(A0), x_(A1) and the chroma sample values of the two smaller sample pairs are denoted as y_(A0), y_(A1). As illustrated in the equation below, equation (24)-(27), the x_(A), x_(B), y_(A) and y_(B) are then derived as the weighted average of the x_(A0), x_(A1), x_(B0), x_(B1), y_(A0), y_(A1) and y_(B0), y_(B1). The parameter α and parameter β are then calculated using the equation (2).

$\begin{matrix} {x_{A} = {\left( {{w1*x_{A0}} + {w2*x_{A1}} + {{offset}1}} \right) \gg {N1}}} & (24) \end{matrix}$ $\begin{matrix} {x_{B} = {\left( {{w3*x_{B0}} + {w4*x_{B1}} + {{offset}2}} \right) \gg {N2}}} & (25) \end{matrix}$ $\begin{matrix} {y_{A} = {\left( {{w1*y_{A0}} + {w2*y_{A1}} + {{offset}1}} \right) \gg {N1}}} & (26) \end{matrix}$ $\begin{matrix} {y_{B} = {\left( {{w3*y_{B0}} + {w4*y_{B1}} + {{offset}2}} \right) \gg {N2}}} & (27) \end{matrix}$

where w1+w2=(1<<N1), offset1=1<<(N1−1); w3+w4=(1<<N2), offset2=1<<(N2−1). where w1 is a first weight factor, w2 is a second weight factor, w3 is a third weight factor, w4 is a fourth weight factor; N1 is the first average value, N2 is the second average value; offset1 is a first offset factor, offset2 is a second offset factor.

In one example where equal weighting is applied, w1=1, w2=1, w3=1, w4=1; N1=1, N2=1 and offset1=1, offset2=1.

In yet another example, w1=3, w2=1, w3=1, w4=3; N1=2, N2=2 and offset1=2, offset2=2.

In another embodiment, the sample pairs which respectively have the largest luma sample value and the smallest luma sample value are identified through luma sample comparisons. The luma sample value of the maximum sample pair is denoted as x_(B) and the chroma sample value of the maximum sample pair is denoted as y_(B); the luma sample value of the minimum sample pair is denoted as x_(A) and the chroma sample value of the minimum sample pair is denoted as y_(A). The parameter α and parameter β are then calculated using the equation (2).

It is noted that, the derivation method for CCLM parameters is not restricted to the mentioned embodiments. The four selected sample pairs could be used in any manner to derive the CCLM parameters.

Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed here. This application is intended to cover any variations, uses, or adaptations of the invention following the general principles thereof and including such departures from the present disclosure as come within known or customary practice in the art. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

It will be appreciated that the present invention is not limited to the exact examples described above and illustrated in the accompanying drawings, and that various modifications and changes can be made without departing from the scope thereof. It is intended that the scope of the invention only be limited by the appended claims.

In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over, as one or more instructions or code, a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the implementations described in the present application. A computer program product may include a computer-readable medium.

Further, the above methods may be implemented using an apparatus that includes one or more circuitries, which include application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), controllers, micro-controllers, microprocessors, or other electronic components. The apparatus may use the circuitries in combination with the other hardware or software components for performing the above described methods. Each module, sub-module, unit, or sub-unit disclosed above may be implemented at least partially using the one or more circuitries.

Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed here. This application is intended to cover any variations, uses, or adaptations of the invention following the general principles thereof and including such departures from the present disclosure as come within known or customary practice in the art. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

It will be appreciated that the present invention is not limited to the exact examples described above and illustrated in the accompanying drawings, and that various modifications and changes can be made without departing from the scope thereof. It is intended that the scope of the invention only be limited by the appended claims. 

What is claimed is:
 1. A method for video decoding, comprising: deriving a first parameter α and a second parameter β for a cross-component linear model (CCLM) mode by using a number of neighboring reconstructed luma samples and neighboring chroma samples of a coding unit (CU); and generating a predicted chroma sample of the CU by using the first parameter a and the second parameter β; wherein deriving the first parameter α and the second parameter β comprises deriving the first parameter a and the second parameter β by using four neighboring down-sampled luma samples and four corresponding chroma samples, wherein each down-sampled luma sample and its corresponding chroma sample correspond to the same row index and the same column index; and wherein deriving the first parameter α and the second parameter β by using four neighboring down-sampled luma samples and four corresponding chroma samples comprises: obtaining the first parameter α and the second parameter β by using a weighted average luma value x_(A) of two smaller luma samples x_(A0), x_(A1) from the four neighboring down-sampled luma samples, a weighted average luma value x_(B) of two larger luma samples x_(B0), x_(B1) from the four neighboring down-sampled luma samples, a weighted average chroma value y_(A) of two chroma samples y_(A0), y_(A1) corresponding to the two smaller luma samples, and a weighted average chroma value y_(B) of two chroma samples y_(B0), y_(B1) corresponding to the two larger luma samples, wherein x_(A), x_(B), y_(A), and y_(B) are obtained based on following equations: $\begin{matrix} {{x_{A} = {\left( {{w1*x_{A0}} + {w2*x_{A1}} + {{offset}1}} \right) \gg {N1}}};} \\ {{x_{B} = {\left( {{w3*x_{B0}} + {w4*x_{B1}} + {{offset}2}} \right) \gg {N2}}};} \\ {{y_{A} = {\left( {{w1*y_{A0}} + {w2*y_{A1}} + {{offset}1}} \right) \gg {N1}}};} \\ {{y_{B} = {\left( {{w3*y_{B0}} + {w4*y_{B1}} + {{offset}2}} \right) \gg {N2}}};} \end{matrix}$ wherein w1+w2=(1<<N1), offset 1=1<<(N 1−1), w3+w4=(1<<N2), offset2=1<<(N2−1), wherein w1 is a first weight factor, w2 is a second weight factor, w3 is a third weight factor, w4 is a fourth weight factor, N1 is a first shift value, N2 is a second shift value, offset1 is a first offset factor, and offset2 is a second offset factor.
 2. The method of claim 1, wherein generating the predicted chroma sample comprises: obtaining the predicted chroma sample based on following equation: Pred_(c)(x, y) = α * rec_(L)^(′)(x, y) + β wherein pred_(c)(x, y) is the predicted chroma sample, rec_(L)′(x, y) is down-sampled reconstructed luma samples of the CU, x indicates a row index, and y indicates a column index.
 3. The method of claim 1, wherein deriving the first parameter α and the second parameter β by using neighboring chroma samples and their corresponding down-sampled luma samples comprises: obtaining the first parameter α and the second parameter β based on following equations: ${\alpha = \frac{y_{B} - y_{A}}{x_{B} - x_{A}}}{\beta = {y_{A} - {\alpha x_{A}}}}$ wherein x_(A), x_(B), y_(A) and y_(B) are derived based on weighted averages of the neighboring chroma samples and their corresponding down-sampled luma samples.
 4. The method of claim 2, wherein the four neighboring down-sampled luma samples and four corresponding chroma samples include one of the following sets: the top sample of the left neighboring samples, the leftmost sample of the above neighboring samples, the bottom sample of the left neighboring samples, and the rightmost sample of the above neighboring samples; the quarter of width of the leftmost sample of the above neighboring samples, the quarter of height of the top sample of the left neighboring samples, the bottom sample of the left neighboring samples, and the rightmost sample of the above neighboring samples; the quarter of width of the leftmost sample of the above neighboring samples, the quarter of height of the top sample of the left neighboring samples, the three quarter of width of the leftmost sample of the above neighboring samples, the three quarter of height of the top sample of the left neighboring samples; the one-eighth of width of the leftmost sample of the above neighboring samples, the three-eighth of width of the leftmost sample of the above neighboring samples, the five-eighth of width of the leftmost sample of the above neighboring samples, the seven-eighth of width of the leftmost sample of the above neighboring samples; and the one-eighth of height of the top sample of the left neighboring samples, the three-eighth of height of the top sample of the left neighboring samples, the five-eighth of height of the top sample of the left neighboring samples, the seven-eighth of height of the top sample of the left neighboring samples.
 5. A computing device, comprising: at least one processor; a non-transitory storage coupled to the one or more processors; and a plurality of programs stored in the non-transitory storage that, when executed by the processor, cause the computing device to perform acts comprising: deriving a first parameter α and a second parameter β for a cross-component linear model (CCLM) mode by using a number of neighboring reconstructed luma samples and neighboring chroma samples of a coding unit (CU); and generating a predicted chroma sample of the CU by using the first parameter α and the second parameter β; wherein deriving the first parameter α and the second parameter β comprises deriving the first parameter α and the second parameter β by using four neighboring down-sampled luma samples and four corresponding chroma samples, wherein each down-sampled luma sample and its corresponding chroma sample correspond to the same row index and the same column index; and wherein deriving the first parameter α and the second parameter β by using four neighboring down-sampled luma samples and four corresponding chroma samples comprises: obtaining the first parameter α and the second parameter β by using a weighted average luma value x_(A) of two smaller luma samples x_(A0), x_(A1) from the four neighboring down-sampled luma samples, a weighted average luma value x_(B) of two larger luma samples x_(B0), x_(B1) from the four neighboring down-sampled luma samples, a weighted average chroma value y_(A) of two chroma samples y_(A0), y_(A1) corresponding to the two smaller luma samples, and a weighted average chroma value y_(B) of two chroma samples y_(B0), y_(B1) corresponding to the two larger luma samples, wherein x_(A), x_(B), y_(A), and y_(B) are obtained based on following equations: $\begin{matrix} {{x_{A} = {\left( {{w1*x_{A0}} + {w2*x_{A1}} + {{offset}1}} \right) \gg {N1}}};} \\ {{x_{B} = {\left( {{w3*x_{B0}} + {w4*x_{B1}} + {{offset}2}} \right) \gg {N2}}};} \\ {{y_{A} = {\left( {{w1*y_{A0}} + {w2*y_{A1}} + {{offset}1}} \right) \gg {N1}}};} \\ {{y_{B} = {\left( {{w3*y_{B0}} + {w4*y_{B1}} + {{offset}2}} \right) \gg {N2}}};} \end{matrix}$ wherein w1+w2=(1<<N1), offset1=1<<(N1−1), w3+w4=(1<<N2), offset2=1<<(N2−1), wherein w1 is a first weight factor, w2 is a second weight factor, w3 is a third weight factor, w4 is a fourth weight factor, N1 is a first average shift value, N2 is a second average shift value, offset1 is a first offset factor, and offset2 is a second offset factor.
 6. The computing device of claim 5, wherein generating the predicted chroma sample comprises: obtaining the predicted chroma sample based on following equation: Pred_(c)(x, y) = α * rec_(L)^(′)(x, y) + β wherein pred_(c)(x, y) is the predicted chroma sample, rec_(L)′(x, y) is the down-sampled reconstructed luma samples of the CU, x indicates a row index, and y indicates a column index.
 7. The computing device of claim 5, wherein deriving the first parameter α and the second parameter β by using neighboring chroma samples and their corresponding down-sampled luma samples comprises: obtaining the first parameter α and the second parameter β based on following equations: ${\alpha = \frac{y_{B} - y_{A}}{x_{B} - x_{A}}}{\beta = {y_{A} - {\alpha x_{A}}}}$ wherein x_(A), x_(B), y_(A) and y_(B) are derived based on weighted averages of the neighboring chroma samples and their corresponding down-sampled luma samples.
 8. The computing device of claim 6, wherein the four neighboring down-sampled luma samples and four corresponding chroma samples include one of the following sets: the top sample of the left neighboring samples, the leftmost sample of the above neighboring samples, the bottom sample of the left neighboring samples, and the rightmost sample of the above neighboring samples; the quarter of width of the leftmost sample of the above neighboring samples, the quarter of height of the top sample of the left neighboring samples, the bottom sample of the left neighboring samples, and the rightmost sample of the above neighboring samples; the quarter of width of the leftmost sample of the above neighboring samples, the quarter of height of the top sample of the left neighboring samples, the three quarter of width of the leftmost sample of the above neighboring samples, the three quarter of height of the top sample of the left neighboring samples; the one-eighth of width of the leftmost sample of the above neighboring samples, the three-eighth of width of the leftmost sample of the above neighboring samples, the five-eighth of width of the leftmost sample of the above neighboring samples, the seven-eighth of width of the leftmost sample of the above neighboring samples; and the one-eighth of height of the top sample of the left neighboring samples, the three-eighth of height of the top sample of the left neighboring samples, the five-eighth of height of the top sample of the left neighboring samples, the seven-eighth of height of the top sample of the left neighboring samples.
 9. A non-transitory computer readable storage medium storing bitstream that when received by a decoding device causes the decoding device to perform acts comprising: deriving a first parameter α and a second parameter β for a cross-component linear model (CCLM) mode by using a number of neighboring reconstructed luma samples and neighboring chroma samples of a coding unit (CU); and generating a predicted chroma sample of the CU by using the first parameter α and the second parameter β; wherein deriving the first parameter α and the second parameter β comprises deriving the first parameter α and the second parameter β by using four neighboring down-sampled luma samples and four corresponding chroma samples, wherein each down-sampled luma sample and its corresponding chroma sample correspond to the same row index and the same column index; and wherein deriving the first parameter α and the second parameter β by using four neighboring down-sampled luma samples and four corresponding chroma samples comprises: obtaining the first parameter α and the second parameter β by using a weighted average luma value x_(A) of two smaller luma samples x_(A0), x_(A1) from the four neighboring down-sampled luma samples, a weighted average luma value x_(B) of two larger luma samples x_(B0), x_(B1) from the four neighboring down-sampled luma samples, a weighted average chroma value y_(A) of two chroma samples y_(A0), y_(A1) corresponding to the two smaller luma samples, and a weighted average chroma value y_(B) of two chroma samples y_(B0), y_(B1) corresponding to the two larger luma samples, wherein x_(A), x_(B), y_(A), and y_(B) are obtained based on following equations: $\begin{matrix} {{x_{A} = {\left( {{w1*x_{A0}} + {w2*x_{A1}} + {{offset}1}} \right) \gg {N1}}};} \\ {{x_{B} = {\left( {{w3*x_{B0}} + {w4*x_{B1}} + {{offset}2}} \right) \gg {N2}}};} \\ {{y_{A} = {\left( {{w1*y_{A0}} + {w2*y_{A1}} + {{offset}1}} \right) \gg {N1}}};} \\ {{y_{B} = {\left( {{w3*y_{B0}} + {w4*y_{B1}} + {{offset}2}} \right) \gg {N2}}};} \end{matrix}$ wherein w1+w2=(1<<N1), offset1=1<<(N1−1), w3+w4=(1<<N2), offset2=1<<(N2−1), wherein w1 is a first weight factor, w2 is a second weight factor, w3 is a third weight factor, w4 is a fourth weight factor, N1 is a first shift value, N2 is a second shift value, offset1 is a first offset factor, and offset2 is a second offset factor.
 10. The non-transitory computer readable storage medium of claim 9, wherein generating the predicted chroma sample comprises: obtaining the predicted chroma sample based on following equation: Pred_(c)(x, y) = α * rec_(L)^(′)(x, y) + β wherein pred_(c)(x, y) is the predicted chroma sample, rec_(L)′(x, y) is down-sampled reconstructed luma samples of the CU, x indicates a row index, and y indicates a column index.
 11. The non-transitory computer readable storage medium of claim 9, wherein deriving the first parameter α and the second parameter β by using neighboring chroma samples and their corresponding down-sampled luma samples comprises: obtaining the first parameter α and the second parameter β based on following equations: ${\alpha = \frac{y_{B} - y_{A}}{x_{B} - x_{A}}}{\beta = {y_{A} - {\alpha x_{A}}}}$ wherein x_(A), X_(B), y_(A) and y_(B) are derived based on weighted averages of the neighboring chroma samples and their corresponding down-sampled luma samples.
 12. The non-transitory computer readable storage medium of claim 10, wherein the four neighboring down-sampled luma samples and four corresponding chroma samples include one of the following sets: the top sample of the left neighboring samples, the leftmost sample of the above neighboring samples, the bottom sample of the left neighboring samples, and the rightmost sample of the above neighboring samples; the quarter of width of the leftmost sample of the above neighboring samples, the quarter of height of the top sample of the left neighboring samples, the bottom sample of the left neighboring samples, and the rightmost sample of the above neighboring samples; the quarter of width of the leftmost sample of the above neighboring samples, the quarter of height of the top sample of the left neighboring samples, the three quarter of width of the leftmost sample of the above neighboring samples, the three quarter of height of the top sample of the left neighboring samples; the one-eighth of width of the leftmost sample of the above neighboring samples, the three-eighth of width of the leftmost sample of the above neighboring samples, the five-eighth of width of the leftmost sample of the above neighboring samples, the seven-eighth of width of the leftmost sample of the above neighboring samples; and the one-eighth of height of the top sample of the left neighboring samples, the three-eighth of height of the top sample of the left neighboring samples, the five-eighth of height of the top sample of the left neighboring samples, the seven-eighth of height of the top sample of the left neighboring samples. 